Speeding up Martins’ algorithm for multiple objective shortest path problems
نویسندگان
چکیده
منابع مشابه
Speeding up Martins' algorithm for multiple objective shortest path problems
The latest transportation systems require the best routes in a large network with respect tomultiple objectives simultaneously to be calculated in a very short time. The label setting algorithm ofMartins efficiently finds this set of Pareto optimal paths, but sometimes tends to be slow, especially for large networks such as transportation networks. In this article we investigate a number of spe...
متن کاملMartins' algorithm revisited for multi-objective shortest path problems with a MaxMin cost function
This paper presents a straight extension of the label setting algorithm proposed by Martins in 1985 for a shortest path problem with multiple objectives. This extended version computes all the efficient paths from a given source vertex, to all the other vertices of the network. The algorithm can cope with problems in which the “cost values” associated with the network arcs are all positive, and...
متن کاملSpeeding Up Shortest Path Algorithms
Given an arbitrary, non-negatively weighted, directed graph G = (V,E) we present an algorithm that computes all pairs shortest paths in time O(mn + m lg n + nTψ(m , n)), where m is the number of different edges contained in shortest paths and Tψ(m , n) is a running time of an algorithm to solve a single-source shortest path problem (SSSP). This is a substantial improvement over a trivial n time...
متن کاملSpeeding Up Dynamic Shortest-Path Algorithms
Dynamic shortest path algorithms update the shortest paths to take into account a change in an edge weight. This paper describes a new technique that allows the reduction of heap sizes used by several dynamic shortest path algorithms. For unit weight change, the updates can be done without heaps. These reductions almost always reduce the computational times for these algorithms. In computationa...
متن کاملA decremental approach with the A⁄ algorithm for speeding-up the optimization process in dynamic shortest path problems
Dynamic (time-dependent) network routing has become important due to the deployment of advanced traveler information systems in navigation systems. We study the problem of speeding-up the shortest path in continuous-time dynamic networks without a priori knowledge of the link travel times. We apply the A⁄ algorithm using the decremental approach to reduce the network size and speed-up the optim...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: 4OR
سال: 2013
ISSN: 1619-4500,1614-2411
DOI: 10.1007/s10288-013-0232-5